package 合并两个排序的链表;

import util.ListNode;

public class Merge {
    public static void main(String[] args) {

    }

    public static ListNode Merge(ListNode list1, ListNode list2){
        if (list1 == null){
            return list2;
        }

        if (list2 == null){
            return list1;
        }

        ListNode dummy = new ListNode(-1);
        ListNode cur = dummy;
        while (list1 != null && list2 != null){
            if (list1.val < list2.val){
                cur.next = list1;
                list1 = list1.next;
            }else {
                cur.next = list2;
                list2 = list2.next;
            }
            cur = cur.next;
        }

        if (list1 != null){
            cur.next = list1;
        }else {
            cur.next = list2;
        }
        return dummy.next;
    }
}
